Dominating Sets for Convex Functions with Some Applications
نویسندگان
چکیده
منابع مشابه
Dominating Sets for Convex Functions with Some Applications
A number of optimization methods require as a rst step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an in nite number of) convex functions, and we show how to o...
متن کاملSOME SIMILARITY MEASURES FOR PICTURE FUZZY SETS AND THEIR APPLICATIONS
In this work, we shall present some novel process to measure the similarity between picture fuzzy sets. Firstly, we adopt the concept of intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets and picture fuzzy sets. Secondly, we develop some similarity measures between picture fuzzy sets, such as, cosine similarity measure, weighted cosine similarity measure, set-theoretic similar...
متن کاملConvex Sets and Convex Functions
In this section, we introduce one of the most important ideas in economic modelling, in the theory of optimization and, indeed in much of modern analysis and computatyional mathematics: that of a convex set. Almost every situation we will meet will depend on this geometric idea. As an independent idea, the notion of convexity appeared at the end of the 19 century, particularly in the works of M...
متن کاملSome Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملRemarks on some inequalities for s-convex functions and applications
holds for all x, y ∈ [,∞), λ ∈ [, ] and for some fixed s ∈ (, ]. The class of s-convex functions in the second sense is usually denoted by K s . It can be easily seen that for s = s-convexity reduces to ordinary convexity of functions defined on [,∞). It is proved in [] that all functions from K s , s ∈ (, ) are nonnegative. Similarly, a function f : [,∞)→ R is said to be s-concav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1998
ISSN: 0022-3239,1573-2878
DOI: 10.1023/a:1022614029984